Suspending Recursion in Causal-Link Planning

Search Strategies for Partial-Order Causal-Link Planning with Preferences

This paper studies how to solve classical planning problems with preferences by means of a partial-order causal-link (POCL) planning algorithm. Preferences are given by soft goals – optional goals which increase a plan’s benefit if satisfied at the end of a plan. Thus, we aim at finding a plan with the best net-benefit, which is the difference of the achieved preferences’ benefit minus the cost...

Quanti cation in Causal Link Planning

Causal Link Semantics for Narrative Planning Using Numeric Fluents

Narrative planners would be able to represent richer, more realistic story domains if they could use numeric variables for certain properties of objects, such as money, age, temperature, etc. Modern state-space narrative planners make use of causal links—structures that represent causal dependencies between actions—but there is no established model of a causal link that applies to actions with ...

Planning and Control of Two-Link Rigid Flexible Manipulators in Dynamic Object Manipulation Missions

This research focuses on proposing an optimal trajectory planning and control method of two link rigid-flexible manipulators (TLRFM) for Dynamic Object Manipulation (DOM) missions. For the first time, achievement of DOM task using a rotating one flexible link robot was taken into account in [20]. The authors do not aim to contribute on either trajectory tracking or vibration control of the End-...

Hybrid Planning Heuristics Based on Task Decomposition Graphs

Hybrid Planning combines Hierarchical Task Network (HTN) planning with concepts known from Partial-Order Causal-Link (POCL) planning. We introduce novel heuristics for Hybrid Planning that estimate the number of necessary modifications to turn a partial plan into a solution. These estimates are based on the task decomposition graph that contains all decompositions of the abstract tasks in the p...